Networking Recon gurable Smart Sensors

نویسنده

  • Michael G. Corr
چکیده

The advances in sensing devices and integrated circuit technology have allowed for the development of easily \recon gurable smart sensor" products. Primarily utilizing commercial o -the-shelf (COTS) components, we have developed recon gurable smart sensors, consisting of a microprocessor, GPS receiver, RF transceiver, and a sensor. The standard serial control interface allows for ease of interchangeability for upgrades in RF transmission schemes as well as customizing the sensing device (i.e. temperature, video images, IR, motion, Ethernet) per application. The result is a exible module capable of gathering sensor data, local processing, and forwarding compressed information to a central location via other modules. In this paper, we present our system infrastructure design and a cost function based geographical self-routing algorithm for networking recon gurable smart sensors. The algorithm allows for the sensors to automatically negotiate in a geographical radial topology relative to a central location, utilizing other sensors as routes or hops for forwarding information to a central location. A number of these sensors are currently deployed out in the eld and we present performance measurements on routing and transmission of sensor data. Scalability issues are addressed in analysis of a very large scale recon gurable smart sensor network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Object oriented development method for recon®gurable embedded systems

The authors present a novel method for developing recon®gurable systems targeted at embedded system applications. The paper shows how an existing object oriented design method (MOOSE) has been adapted to include recon®gurable hardware (FPGAs). Previous research on recon®gurable computing has concentrated on the ef®cient mapping of algorithms to FPGAs. It must be realised that recon®gurable hard...

متن کامل

Optimal Algorithms for Constrained Recon gurable Meshes

This paper introduces a constrained recon gurable mesh model which incorporates practical assump tions about propagation delays on large sized buses Simulations of optimal recon gurable mesh algo rithms on the constrained recon gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems are then presented For the problems investigated the con strain...

متن کامل

Recon gurable Computing: Architectures, Models and Algorithms

The performance requirements of applications have continuously superseded the computing power of architecture platforms. Increasingly larger number of transistors available on a chip have resulted in complex architectures and integration of various architecture components on the chip. But, the incremental performance gains obtained are lower as the complexity and the integration increase. Recon...

متن کامل

A Novel Dynamic Task Scheduling Algorithm for Grid Networks with Recon gurable Processors

The incorporation of recon gurable processors in computational grids promises to provide increased performance without compromising exibility. Consequently, grid networks (such as TeraGrid) are utilizing recon gurable computing resources next to general-purpose processors (GPPs) in their computing nodes. The near-optimal utilization of resources in a grid network considerably depends on the app...

متن کامل

Optimal Algorithms for Constrained Reconfigurable Meshes

This paper introduces a constrained recon gurable mesh model which incorpo rates practical assumptions about propagation delays on large sized buses Sim ulations of AT optimal recon gurable mesh algorithms on the constrained re con gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems requiring less area are then presented For the problems inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000